knapsack problem
英 [ˈnæpsæk ˈprɒbləm]
美 [ˈnæpsæk ˈprɑːbləm]
网络 背包问题; 背包题目
双语例句
- So let's look at an example of a zero-one knapsack problem.
我们要像之前一样将其最优化，现在让我们来看一个0/1背包问题的例子。 - The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。 - A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
提出了一种蚁群系统与多选择背包问题融合的算法。 - Immune algorithm with antibody-repaired and its application for high-dimensional 0/ 1 knapsack problem
抗体修正免疫算法对高维0/1背包问题的应用 - So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.
所以我并没有施魔法，我已经告诉了你，一种快速解决背包问题的方法了，但是某些方面它的核心仍然是指数增长的。 - An improved pseudo-parallel genetic algorithm which comprehensively adopts different greedy algorithms is proposed to solve the0/ 1 knapsack problem.
文章提出了综合运用不同贪婪解码策略的改进型伪并行遗传算法以求解0/1背包问题。 - Particle Swarm Optimization about 0/ 1 Knapsack Problem
关于0/1背包问题的粒子群优化算法 - Solving Knapsack Problem with Improved Pseudo-parallel Genetic Algorithm
基于改进型伪并行遗传算法的背包问题求解 - Solution of 0-1 Knapsack Problem Applying Improved CSA Algorithm
改进的克隆选择算法求解0-1背包问题 - Trial designed recursive algorithm for solving knapsack problem.
试用递归方法设计求解背包问题的算法。 - Repair Strategies for Multiobjective 0/ 1 Knapsack Problem in MOEA
多目标0/1背包问题MOEA求解中的修复策略 - Mixed Coding Greedy Differential Evolution Algorithm for 0-1 Knapsack Problem
解0-1背包问题的混合编码贪婪DE算法 - This paper describes the0/ 1 knapsack problem, a mathematical model, and explains the basic theory of shuffled frog leaping algorithm.
描述了0／1背包问题的数学模型，阐述了混合蛙跳算法的基本理论。 - In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。 - New genetic algorithm to solve 0-1 knapsack problem
一种求解0-1背包问题的新遗传算法 - The study on greedy local search algorithm of 0-1 knapsack problem
0-1背包问题的贪心局部搜索算法研究 - An improved tabu search algorithm for knapsack problem
一种改进的禁忌搜索算法求解背包问题 - Proxy Signature Scheme Based on Knapsack Problem and Conic Curves Public-key Cryptosystem
基于背包和圆锥曲线相结合的代理签名方案研究 - Hybrid Genetic Algorithm for Multiconstraint 0-1 Knapsack Problem
求解多限制0-1背包问题的混合遗传算法 - An Improved Genetic Algorithm for Knapsack Problem
一种求解背包问题的改进遗传算法 - Collaborative Particle Swarm Optimization Algorithm for Knapsack Problem Based on Multi-Agent
多代理协作粒子群背包问题求解算法 - Genetic algorithm with schema replaced for solving 0/ 1 knapsack problem
一种基于模式替代的遗传算法解0/1背包问题 - Virus-evolutionary particle swarm optimization algorithm for knapsack problem
求解背包问题的病毒协同进化粒子群算法 - Multiagent-Based Evolutionary Algorithm for Dynamic Knapsack Problem
求解动态背包问题的多智能体进化算法 - Let's now go back and instantiate these ideas for the knapsack problem we looked at last time In particular, for the0-1 knapsack problem.
让我们回来用具体例子，来说明我们上次看过的背包问题，特别是对0-1背包问题来说。 - By introducing the transformative knapsack problem into the scheme, the security of new scheme one is strengthened.
通过引入变形的背包问题，新方案一的安全性进一步提高。 - Then, analyzed from calculation methods, this model is a type of Knapsack Problem with restrictions between lower-limit and upper-limit, which is a discontinuous and multi-maximum complicated problem.
然后从计算方法上，将该贷款组合优化问题归结为一类有上下限的非连续、多峰的特殊背包问题。 - The security of the scheme is set up on the intricate nature of the elliptic curve discrete logarithm problem and the knapsack problem.
方案的安全性建立在椭圆曲线离散对数问题和变形的背包问题的难解性上。 - A Method for 0/ 1 Knapsack Problem Which Value Equal with Weight
价值与重量相等的0/1背包问题的一种解法 - The function optimization and knapsack problem show the effectiveness of PEA.
积性效用函数的度量函数优化和背包问题实验验证了PEA的有效性。